Neighbor based partitioning constraints

ABSTRACT

Systems, methods, apparatus for video processing are described. A video processing method includes determining, for a conversion between a current block of a video and a bitstream of the video, whether or which a partitioning scheme is enabled for coding of the current block according to a rule, and performing the conversion based on the determining. The rule is based on one or more neighboring blocks of the current block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Patent Application No. PCT/CN2022/085261, filed on Apr. 6, 2022 which claims the benefit of International Patent Application No. PCT/CN2021/085511 filed on Apr. 5, 2021. All the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This present disclosure relates to generation, storage, and consumption of digital audio video media information in a file format.

BACKGROUND

Digital video accounts for the largest bandwidth used on the Internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, the bandwidth demand for digital video usage is likely to continue to grow.

SUMMARY

A first aspect relates to a method for processing video data comprising determining whether a partitioning scheme is enabled for coding of a current block based on a rule associated with one or more neighboring blocks of the current block, and performing a conversion between a visual media data and a bitstream based on whether the partitioning scheme is enabled for coding of the current block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the method further comprises disallowing use of a neighboring block for determining whether a partitioning scheme is enabled for the current block when the current block is coded before the neighboring block, the current block is in a different coding tree unit (CTU) row than the neighboring block, the current block is in a different virtual pipeline data unit (VPDU) than the neighboring block, the current block is in a different subpicture than the neighboring block, the current block is in a different slice than the neighboring block, the current block is in a different tile than the neighboring block, or combinations thereof.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the one or more neighboring blocks of the current block comprise at least one of a top left upper neighboring block, a top right upper neighboring block, a top left lower neighboring block, or a bottom left upper neighboring block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that one or more neighboring blocks are adjacent to the current block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on at least one of a width of the current block, a height of the current block, or a top left coordinate position of the current block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on a comparison between at least one of a width or a height of the current block with a threshold, wherein the threshold is determined based on a candidate split position related to the one or more neighboring blocks.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on dimensions of a neighboring block or a top left coordinate position of a coding unit containing the neighboring block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on whether at least two of the one or more neighboring blocks are in a same coding unit.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule is further based on at least one of whether there are non-zero residues in the coding unit, whether a slice type of the coding unit is intra-prediction slice (I-slice), or whether the coding unit is coded according to a specific mode.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on whether a first two of the one or more neighboring blocks are in a first common coding unit, and whether a second two of the one or more neighboring blocks are in a second common coding unit, and wherein the first common coding unit and the second common coding unit are different coding units.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on a comparison between a threshold and a number of coding units containing the one or more neighboring blocks.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the threshold is based on at least one of a width of the current block, a height of the current block, a candidate split position in the current block, a color component of the current block, or a maximum coding unit size.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on at least one of a prediction mode, an identity of a sequence, a picture, a slice, a coding tree unit (CTU)-level information of the one or more neighboring blocks.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the rule further specifies a constraint on including an indication of the partitioning scheme in the bitstream.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the constraint specifies that the bitstream omits an indication of the partitioning scheme when a single partitioning scheme is enabled for coding of the current block.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the constraint specifies that the partitioning scheme enabled for coding of the current block is included in the bitstream using a codeword, and wherein a partitioning scheme that is disabled for coding of the current block is excluded from the codeword.

Optionally, in any of the preceding aspects, another implementation of the aspect provides that the constraint is based on at least one of depth information, block dimension, or a prediction mode, of the one or more of the neighboring blocks.

A second aspect relates to a non-transitory computer readable medium comprising a computer program product for use by a video coding device, the computer program product comprising computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the video coding device to perform the method of any of the preceding aspects.

A third aspect relates to an apparatus for processing video data comprising: a processor; and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform the method of any of the preceding aspects.

A fourth aspect relates to a non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises determining whether a partitioning scheme is enabled for coding of a current block based on a rule associated with one or more neighboring blocks of the current block, and generating the bitstream based on the determination of whether the partitioning scheme is enabled for coding of the current block.

A fifth aspect relates to a method for storing bitstream of a video, comprising determining whether a partitioning scheme is enabled for coding of a current block based on a rule associated with one or more neighboring blocks of the current block, generating the bitstream based on the determination of whether the partitioning scheme is enabled for coding of the current block, and storing the bitstream in a non-transitory computer-readable recording medium.

For the purpose of clarity, any one of the foregoing embodiments may be combined with any one or more of the other foregoing embodiments to create a new embodiment within the scope of the present disclosure.

These and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.

FIG. 1 is a schematic diagram of an example coding and decoding (codec) for video coding.

FIG. 2 is a schematic diagram of example macroblock partitions.

FIG. 3 is a schematic diagram of example modes for partitioning coding blocks, for example according to High Efficiency Video Coding (HEVC).

FIG. 4 is a schematic diagram of example method for partitioning a picture for coding residual.

FIG. 5 is a schematic diagram of example method for partitioning a picture, for example according to a quad tree binary tree (QTBT) structure.

FIG. 6 is a schematic diagram of example partitioning structures used in Versatile Video Coding (VVC).

FIG. 7 is a schematic diagram of example extended quad tree (EQT) partitioning structures.

FIG. 8 is a schematic diagram of example flexible tree (FT) partitioning structures.

FIG. 9 is a schematic diagram of example generalized triple tree (TT) (GTT) partitioning structures.

FIG. 10 is a schematic diagram of example boundary partitioning tree.

FIG. 11 is a schematic diagram of example partitioning structures used in Audio and Video Coding Standard (AVS) part three (AVS-3.0).

FIG. 12 is a schematic diagram of example Unsymmetrical Quad-Tree (UQT) partitioning structures.

FIG. 13 is a schematic diagram of example Extended Ternary-Tree (ETT) partitioning structures.

FIG. 14 is a schematic diagram of example ¼ Unsymmetric Binary Tree (UBT) partitioning structures.

FIG. 15 is a schematic diagram of an example current block surrounded by multiple neighboring blocks, adjacent to or non-adjacent to a coding unit.

FIG. 16 is a block diagram showing an example video processing system.

FIG. 17 is a block diagram of an example video processing apparatus.

FIG. 18 is a flowchart for an example method of video processing.

FIG. 19 is a block diagram that illustrates an example video coding system.

FIG. 20 is a block diagram that illustrates an example encoder.

FIG. 21 is a block diagram that illustrates an example decoder.

FIG. 22 is a schematic diagram of an example encoder.

DETAILED DESCRIPTION

It should be understood at the outset that although an illustrative implementation of one or more embodiments are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or yet to be developed. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the exemplary designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.

Versatile Video Coding (VVC), also known as H.266, terminology is used in some description only for ease of understanding and not for limiting scope of the disclosed techniques. As such, the techniques described herein are applicable to other video codec protocols and designs also. In the present disclosure, editing changes are shown to text by bold italics indicating cancelled text and bold underline indicating added text, with respect to the VVC specification or International Organization for Standardization (ISO) base media file format (ISOBMFF) file format specification.

This disclosure is related to image/video coding, and more particularly to transforms on some special kinds of blocks. The disclosed mechanisms may be applied to the video coding standards such as High Efficiency Video Coding (HEVC) and/or Versatile Video Coding (VVC). Such mechanisms may also be applicable to other video coding standards and/or video codecs.

Video coding standards have evolved primarily through the development of the International Telecommunication Union (ITU) Telecommunication Standardization Sector (ITU-T) and International Organization for Standardization (ISO)/International Electrotechnical Commission (IEC) standards. The ITU-T produced a H.261 standard and a H.263 standard, ISO/IEC produced Motion Picture Experts Group (MPEG) phase one (MPEG-1) and MPEG phase four (MPEG-4) Visual standards, and the two organizations jointly produced the H.262/MPEG phase two (MPEG-2) Video standard, the H.264/MPEG-4 Advanced Video Coding (AVC) standard, and the H.265/High Efficiency Video Coding (HEVC) standard. Since H.262, the video coding standards are based on a hybrid video coding structure that utilizes a temporal prediction plus a transform coding.

FIG. 1 is a schematic diagram of an example coding and decoding (codec) for video coding, for example according to HEVC. For example, codec 100 provides functionality to support converting a video file into a bitstream by encoding and/or decoding pictures. Codec 100 is generalized to depict components employed in both an encoder and a decoder. Codec 100 receives a stream of pictures as a video signal 101 and partitions the pictures. Codec 100 then compresses the pictures in the video signal 101 into a coded bitstream when acting as an encoder. When acting as a decoder, codec system 100 generates an output video signal from the bitstream. The codec 100 includes a general coder control component 111, a transform scaling and quantization component 113, an intra-picture estimation component 115, an intra-picture prediction component 117, a motion compensation component 119, a motion estimation component 121, a scaling and inverse transform component 129, a filter control analysis component 127, an in-loop filters component 125, a decoded picture buffer component 123, and a header formatting and context adaptive binary arithmetic coding (CABAC) component 131. Such components are coupled as shown. In FIG. 1 , black lines indicate movement of data to be encoded/decoded while dashed lines indicate movement of control data that controls the operation of other components. The components of codec 100 may all be present in the encoder. The decoder may include a subset of the components of codec 100. For example, the decoder may include the intra-picture prediction component 117, the motion compensation component 119, the scaling and inverse transform component 129, the in-loop filters component 125, and the decoded picture buffer component 123. These components are now described.

The video signal 101 is a captured video sequence that has been partitioned into blocks of pixels by a coding tree. A coding tree employs various split modes to subdivide a block of pixels into smaller blocks of pixels. These blocks can then be further subdivided into smaller blocks. The blocks may be referred to as nodes on the coding tree. Larger parent nodes are split into smaller child nodes. The number of times a node is subdivided is referred to as the depth of the node/coding tree. The divided blocks can be included in coding units (CUs) in some cases. For example, a CU can be a sub-portion of a coding tree unit (CTU) that contains a luma block, red difference chroma (Cr) block(s), and a blue difference chroma (Cb) block(s) along with corresponding syntax instructions for the CU. The split modes may include a binary tree (BT), a triple tree (TT), and a quad tree (QT) employed to partition a node into two, three, or four child nodes, respectively, of varying shapes depending on the split modes employed. The video signal 101 is forwarded to the general coder control component 111, the transform scaling and quantization component 113, the intra-picture estimation component 115, the filter control analysis component 127, and the motion estimation component 121 for compression.

The general coder control component 111 is configured to make decisions related to coding of the images of the video sequence into the bitstream according to application constraints. For example, the general coder control component 111 manages optimization of bitrate/bitstream size versus reconstruction quality. Such decisions may be made based on storage space/bandwidth availability and image resolution requests. The general coder control component 111 also manages buffer utilization in light of transmission speed to mitigate buffer underrun and overrun issues. To manage these issues, the general coder control component 111 manages partitioning, prediction, and filtering by the other components. For example, the general coder control component 111 may increase compression complexity to increase resolution and increase bandwidth usage or decrease compression complexity to decrease resolution and bandwidth usage. Hence, the general coder control component 111 controls the other components of codec 100 to balance video signal reconstruction quality with bit rate concerns. The general coder control component 111 creates control data, which controls the operation of the other components. The control data is also forwarded to the header formatting and CABAC component 131 to be encoded in the bitstream to signal parameters for decoding at the decoder.

The video signal 101 is also sent to the motion estimation component 121 and the motion compensation component 119 for inter-prediction. A video unit (e.g., a picture, a slice, a CTU, etc.) of the video signal 101 may be divided into multiple blocks. Motion estimation component 121 and the motion compensation component 119 perform inter-predictive coding of the received video block relative to one or more blocks in one or more reference pictures to provide temporal prediction. Codec system 100 may perform multiple coding passes, e.g., to select an appropriate coding mode for each block of video data.

Motion estimation component 121 and motion compensation component 119 may be highly integrated, but are illustrated separately for conceptual purposes. Motion estimation, performed by motion estimation component 121, is the process of generating motion vectors, which estimate motion for video blocks. A motion vector, for example, may indicate the displacement of a coded object in a current block relative to a reference block. A reference block is a block that is found to closely match the block to be coded, in terms of pixel difference. Such pixel differences may be determined by sum of absolute difference (SAD), sum of square difference (SSD), or other difference metrics. HEVC employs several coded objects including a CTU, coding tree blocks (CTBs), and CUs. For example, a CTU can be divided into CTBs, which can then be divided into CBs for inclusion in CUs. A CU can be encoded as a prediction unit (PU) containing prediction data and/or a transform unit (TU) containing transformed residual data for the CU. The motion estimation component 121 generates motion vectors, PUs, and TUs by using a rate-distortion analysis as part of a rate distortion optimization process. For example, the motion estimation component 121 may determine multiple reference blocks, multiple motion vectors, etc. for a current block/frame, and may select the reference blocks, motion vectors, etc. having the best rate-distortion characteristics. The best rate-distortion characteristics balance both quality of video reconstruction (e.g., amount of data loss by compression) with coding efficiency (e.g., size of the final encoding).

In some examples, codec 100 may calculate values for sub-integer pixel positions of reference pictures stored in decoded picture buffer component 123. For example, video codec 100 may interpolate values of one-quarter pixel positions, one-eighth pixel positions, or other fractional pixel positions of the reference picture. Therefore, motion estimation component 121 may perform a motion search relative to the full pixel positions and fractional pixel positions and output a motion vector with fractional pixel precision. The motion estimation component 121 calculates a motion vector for a PU of a video block in an inter-coded slice by comparing the position of the PU to the position of a reference block of a reference picture. Motion estimation component 121 outputs the calculated motion vector as motion data to header formatting and CABAC component 131 for encoding and to the motion compensation component 119.

Motion compensation, performed by motion compensation component 119, may involve fetching or generating a reference block based on the motion vector determined by motion estimation component 121. Motion estimation component 121 and motion compensation component 119 may be functionally integrated, in some examples. Upon receiving the motion vector for the PU of the current video block, motion compensation component 119 may locate the reference block to which the motion vector points. A residual video block is then formed by subtracting pixel values of the reference block from the pixel values of the current block being coded, forming pixel difference values. In general, motion estimation component 121 performs motion estimation relative to luma components, and motion compensation component 119 uses motion vectors calculated based on the luma components for both chroma components and luma components. The reference block and residual block are forwarded to transform scaling and quantization component 113.

The video signal 101 is also sent to intra-picture estimation component 115 and intra-picture prediction component 117. As with motion estimation component 121 and motion compensation component 119, intra-picture estimation component 115 and intra-picture prediction component 117 may be highly integrated, but are illustrated separately for conceptual purposes. The intra-picture estimation component 115 and intra-picture prediction component 117 intra-predict a current block relative to blocks in a current picture, as an alternative to the inter-prediction performed by motion estimation component 121 and motion compensation component 119 between pictures, as described above. In particular, the intra-picture estimation component 115 determines an intra-prediction mode to use to encode a current block. In some examples, intra-picture estimation component 115 selects an appropriate intra-prediction mode to encode a current block from multiple tested intra-prediction modes. The selected intra-prediction modes are then forwarded to the header formatting and CABAC component 131 for encoding.

For example, the intra-picture estimation component 115 calculates rate-distortion values using a rate-distortion analysis for the various tested intra-prediction modes, and selects the intra-prediction mode having the best rate-distortion characteristics among the tested modes. Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original unencoded block that was encoded to produce the encoded block, as well as a bitrate (e.g., a number of bits) used to produce the encoded block. The intra-picture estimation component 115 calculates ratios from the distortions and rates for the various encoded blocks to determine which intra-prediction mode exhibits the best rate-distortion value for the block. In addition, intra-picture estimation component 115 may be configured to code depth blocks of a depth map using a depth modeling mode (DMM) based on rate-distortion optimization (RDO).

The intra-picture prediction component 117 may generate a residual block from the reference block based on the selected intra-prediction modes determined by intra-picture estimation component 115 when implemented on an encoder or read the residual block from the bitstream when implemented on a decoder. The residual block includes the difference in values between the reference block and the original block, represented as a matrix. The residual block is then forwarded to the transform scaling and quantization component 113. The intra-picture estimation component 115 and the intra-picture prediction component 117 may operate on both luma and chroma components.

The transform scaling and quantization component 113 is configured to further compress the residual block. The transform scaling and quantization component 113 applies a transform, such as a discrete cosine transform (DCT), a discrete sine transform (DST), or a conceptually similar transform, to the residual block, producing a video block comprising residual transform coefficient values. Wavelet transforms, integer transforms, sub-band transforms or other types of transforms could also be used. The transform may convert the residual information from a pixel value domain to a transform domain, such as a frequency domain. The transform scaling and quantization component 113 is also configured to scale the transformed residual information, for example based on frequency. Such scaling involves applying a scale factor to the residual information so that different frequency information is quantized at different granularities, which may affect final visual quality of the reconstructed video. The transform scaling and quantization component 113 is also configured to quantize the transform coefficients to further reduce bit rate. The quantization process may reduce the bit depth associated with some or all of the coefficients. The degree of quantization may be modified by adjusting a quantization parameter. In some examples, the transform scaling and quantization component 113 may then perform a scan of the matrix including the quantized transform coefficients. The quantized transform coefficients are forwarded to the header formatting and CABAC component 131 to be encoded in the bitstream.

The scaling and inverse transform component 129 applies a reverse operation of the transform scaling and quantization component 113 to support motion estimation. The scaling and inverse transform component 129 applies inverse scaling, transformation, and/or quantization to reconstruct the residual block in the pixel domain, e.g., for later use as a reference block for another current block. The motion estimation component 121 and/or motion compensation component 119 may calculate a further reference block by adding the residual block back to a previous reference block for use in motion estimation of a later block/frame. Filters are applied to the reconstructed reference blocks to mitigate artifacts created during scaling, quantization, and transform. Such artifacts could otherwise cause inaccurate prediction (and create additional artifacts) when subsequent blocks are predicted.

The filter control analysis component 127 and the in-loop filters component 125 apply the filters to the residual blocks and/or to reconstructed picture blocks. For example, the transformed residual block from the scaling and inverse transform component 129 may be combined with a corresponding reference block from intra-picture prediction component 117 and/or motion compensation component 119 to reconstruct the original image block. The filters may then be applied to the reconstructed image block. In some examples, the filters may instead be applied to the residual blocks. As with other components in FIG. 1 , the filter control analysis component 127 and the in-loop filters component 125 are highly integrated and may be implemented together, but are depicted separately for conceptual purposes. Filters applied to the reconstructed reference blocks are applied to particular spatial regions and include multiple parameters to adjust how such filters are applied. The filter control analysis component 127 analyzes the reconstructed reference blocks to determine where such filters should be applied and sets corresponding parameters. Such data is forwarded to the header formatting and CABAC component 131 as filter control data for encoding. The in-loop filters component 125 applies such filters based on the filter control data. The filters may include a deblocking filter, a noise suppression filter, a SAO filter, and an adaptive loop filter. Such filters may be applied in the spatial/pixel domain (e.g., on a reconstructed pixel block) or in the frequency domain, depending on the example.

When operating as an encoder, the filtered reconstructed image block, residual block, and/or prediction block are stored in the decoded picture buffer component 123 for later use in motion estimation as discussed above. When operating as a decoder, the decoded picture buffer component 123 stores and forwards the reconstructed and filtered blocks toward a display as part of an output video signal. The decoded picture buffer component 123 may be any memory device capable of storing prediction blocks, residual blocks, and/or reconstructed image blocks.

The header formatting and CABAC component 131 receives the data from the various components of codec 100 and encodes such data into a coded bitstream for transmission toward a decoder. Specifically, the header formatting and CABAC component 131 generates various headers to encode control data, such as general control data and filter control data. Further, prediction data, including intra-prediction and motion data, as well as residual data in the form of quantized transform coefficient data are all encoded in the bitstream. The final bitstream includes all information desired by the decoder to reconstruct the original partitioned video signal 101. Such information may also include intra-prediction mode index tables (also referred to as codeword mapping tables), definitions of encoding contexts for various blocks, indications of most probable intra-prediction modes, an indication of partition information, etc. Such data may be encoded by employing entropy coding. For example, the information may be encoded by employing context adaptive variable length coding (CAVLC), CABAC, syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding, or another entropy coding technique. Following the entropy coding, the coded bitstream may be transmitted to another device (e.g., a video decoder) or archived for later transmission or retrieval.

In order to encode and/or decode a picture as described above, the picture is first partitioned. FIG. 2 is a schematic diagram of example macroblock partitions 200, which can be created by a partition tree structure pursuant to H.264/AVC. The core of the coding layer in such standards is the macroblock, containing a 16×16 block of luma samples and, in the case of 4:2:0 color sampling, two corresponding 8×8 blocks of chroma samples. An intra-coded block uses spatial prediction to exploit spatial correlation among pixels. Two partitions are defined for an intra-coded block, namely a 16×16 sub-block and 4×4 sub-block. An inter-coded block uses temporal prediction, instead of spatial prediction, by estimating motion among pictures. Motion can be estimated independently for either a 16×16 macroblock or any sub-macroblock partitions. An inter-coded block can be partitioned into a 16×8 sub-block, an 8×16 sub-block, an 8×8 sub-block, an 8×4 sub-block, a 4×8 sub-block, and/or a 4×4 sub-block. All such values are measured in a number of samples. A sample is a luma (light) value or chroma (color) value at a pixel.

FIG. 3 is a schematic diagram of example modes 300 for partitioning coding blocks, for example according to HEVC. In HEVC, a picture is partitioned into CTUs. A CTU is split into CUs by using a quadtree structure denoted as a coding tree to adapt to various local characteristics. The decision whether to code a picture area using inter-picture (temporal) or intra-picture (spatial) prediction is made at the CU level. Each CU can be further split into one, two, or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU. One feature of the HEVC structure is that HEVC has multiple partition conceptions including CU, PU, and TU.

Various features involved in hybrid video coding using HEVC are highlighted as follows. HEVC includes the CTU, which is analogous to the macroblock in AVC. The CTU has a size selected by the encoder and can be larger than a macroblock. The CTU includes a luma coding tree block (CTB), corresponding chroma CTBs, and syntax elements. The size of a luma CTB, denoted as L×L, can be chosen as L=16, 32, or 64 samples with the larger sizes resulting in better compression. HEVC then supports a partitioning of the CTBs into smaller blocks using a tree structure and quadtree-like signaling.

The quadtree syntax of the CTU specifies the size and positions of corresponding luma and chroma CBs. The root of the quadtree is associated with the CTU. Hence, the size of the luma CTB is the largest supported size for a luma CB. The splitting of a CTU into luma and chroma CBs is signaled jointly. One luma CB and two chroma CBs, together with associated syntax, form a coding unit (CU). A CTB may contain only one CU or may be split to form multiple CUs. Each CU has an associated partitioning into prediction units (PUs) and a tree of transform units (TUs). The decision of whether to code a picture area using inter picture or intra picture prediction is made at the CU level. A PU partitioning structure has a root at the CU level. Depending on the basic prediction-type decision, the luma and chroma CBs can then be further split in size and predicted from luma and chroma prediction blocks (PBs) according to modes 300. HEVC supports variable PB sizes from 64×64 down to 4×4 samples. As shown, modes 300 can split a CB of size M pixels by M pixels into an M×M block, a M/2×M block, a M×M/2 block, a M/2×M/2 block, a M/4×M (left) block, a M/4×M (right) block, a M×M/4 (up) block, and/or a M×M/4 (down) block. It should be noted that the modes 300 for splitting CBs into PBs are subject to size constraints. Further, only M×M and M/2×M/2 are supported for intra picture predicted CBs.

FIG. 4 is a schematic diagram of example method 400 for partitioning a picture for coding residual, for example according to HEVC. As noted above, blocks are coded by reference to reference blocks. A difference between values of a current block and the reference blocks is known as the residual. Method 400 is employed to compress the residual. For example, the prediction residual is coded using block transforms. Method 400 employs a TU tree structure 403 to partition a CTB 401 and included CBs for application of transform blocks (TBs). Method 400 illustrates the subdivision of a CTB 401 into CBs and TBs. Solid lines indicate CB boundaries and dotted lines indicate TB boundaries. The TU tree structure 403 is an example quadtree that partitions the CTB 401. A transform, such as discrete cosine transform (DCT), is applied to each TB. The transform converts the residual into transform coefficients that can be represented using less data than the uncompressed residual. The TU tree structure 403 has a root at the CU level. The luma CB residual area may be identical to the luma TB area or may be further split into smaller luma TBs. The same applies to the chroma TBs. Integer basis transform functions similar to those of a DCT are defined for the square TB sizes 4×4, 8×8, 16×16, and 32×32. For the 4×4 transform of luma intra picture prediction residuals, an integer transform derived from a form of DST is alternatively specified.

A quadtree plus binary tree block structure with larger CTUs in Joint Exploration Model (JEM) is discussed below. Joint Video Exploration Team (JVET) was founded by Video Coding Experts group (VCEG) and MPEG to explore video coding technologies beyond HEVC. JVET has adopted many improvements included such improvements into a reference software named Joint Exploration Model (JEM).

FIG. 5 is a schematic diagram of example method 500 for partitioning a picture, for example according to a quad tree binary tree (QTBT) structure 501. A tree representation 503 of the QTBT structure 501 is also shown. Unlike the partitioning structures in HEVC, the QTBT structure 501 removes the concepts of multiple partition types. For example, the QTBT structure 501 removes the separation of the CU, PU, and TU concepts, and supports more flexibility for CU partition shapes. In the QTBT structure 501, a CU can have either a square or rectangular shape. In method 500, a CTU is first partitioned by a quadtree structure. The quadtree leaf nodes are further partitioned by a binary tree structure. Symmetric horizontal splitting and symmetric vertical splitting are two splitting types used in the binary tree. The binary tree leaf nodes are called CUs, and that segmentation is used for prediction and transform processing without further partitioning. This causes the CU, PU, and TU to have the same block size in the QTBT structure 501. In the JEM, a CU sometimes includes CBs of different color components. For example, one CU may contain one luma CB and two chroma CBs in the case of unidirectional inter prediction (P) and bidirectional inter prediction (B) slices of the 4:2:0 chroma format. Further, the CU sometimes includes a CB of a single component. For example, one CU may contain only one luma CB or just two chroma CBs in the case of intra prediction (I) slices.

The following parameters are defined for the QTBT partitioning scheme. The CTU size is the root node size of a quadtree, which is the same concept as in HEVC. Minimum quad tree size (MinQTSize) is the minimum allowed quadtree leaf node size. Maximum binary tree size (MaxBTSize) is the maximum allowed binary tree root node size. Maximum binary tree depth (MaxBTDepth) is the maximum allowed binary tree depth. Minimum binary tree size (MinBTSize) is the minimum allowed binary tree leaf node size.

In one example of the QTBT structure 501, the CTU size is set as 128×128 luma samples with two corresponding 64×64 blocks of chroma samples, the MinQTSize is set as 16×16, the MaxBTSize is set as 64×64, the MinBTSize (for both width and height) is set as 4×4, and the MaxBTDepth is set as 4. The quadtree partitioning is applied to the CTU first to generate quadtree leaf nodes. The quadtree leaf nodes may have a size from 16×16 (the MinQTSize) to 128×128 (the CTU size). If the leaf quadtree node is 128×128, the node is not to be further split by the binary tree since the size exceeds the MaxBTSize (e.g., 64×64). Otherwise, the leaf quadtree node can be further partitioned by the binary tree. Therefore, the quadtree leaf node is also the root node for the binary tree and has the binary tree depth as 0. When the binary tree depth reaches MaxBTDepth (e.g., 4), no further splitting is considered. When the binary tree node has width equal to MinBTSize (e.g., 4), no further horizontal splitting is considered. Similarly, when the binary tree node has a height equal to MinBTSize, no further vertical splitting is considered. The leaf nodes of the binary tree are further processed by prediction and transform processing without any further partitioning. In the JEM, the maximum CTU size is 256×256 luma samples.

Method 500 illustrates an example of block partitioning by using the QTBT structure 501, and tree representation 503 illustrates the corresponding tree representation. The solid lines indicate quadtree splitting and dotted lines indicate binary tree splitting. In each splitting (e.g., non-leaf) node of the binary tree, one flag is signalled to indicate which splitting type (e.g., horizontal or vertical) is used, where 0 indicates horizontal splitting and 1 indicates vertical splitting. For the quadtree splitting, there is no need to indicate the splitting type since quadtree splitting always splits a block both horizontally and vertically to produce 4 sub-blocks with an equal size.

In addition, the QTBT scheme supports the ability for the luma and chroma to have a separate QTBT structure 501. For example, in P and B slices the luma and chroma CTBs in one CTU share the same QTBT structure 501. However, in I slices the luma CTB is partitioned into CUs by a QTBT structure 501, and the chroma CTBs are partitioned into chroma CUs by another QTBT structure 501. Accordingly, a CU in an I slice can include a coding block of the luma component or coding blocks of two chroma components. Further, a CU in a P or B slice includes coding blocks of all three color components. In HEVC, inter prediction for small blocks is restricted to reduce the memory access of motion compensation, such that bi-prediction is not supported for 4×8 and 8×4 blocks, and inter prediction is not supported for 4×4 blocks. In the QTBT of the JEM, these restrictions are removed.

Triple-tree partitioning for VVC is now discussed. FIG. 6 is a schematic diagram 600 of example partitioning structures used in VVC. As shown, split types other than quad-tree and binary-tree are supported in VVC. For example, schematic diagram 600 includes a quad tree partition 601, a vertical binary tree partition 603, a horizontal binary tree partition 605, a vertical triple tree partition 607, and a horizontal triple tree partition 609. This approach introduces two triple tree (TT) partitions in addition to the quad tree and binary trees.

In an example implementation, two levels of trees are employed including a region tree (a quad-tree) and a prediction tree (binary-tree or triple-tree). A CTU is first partitioned by a region tree (RT). A RT leaf may be further split with prediction tree (PT). A PT leaf may also be further split with PT until a max PT depth is reached. A PT leaf is a basic coding unit. The PT may also be called a CU for convenience. In an example implementation, a CU cannot be further split. Prediction and transform are both applied on CU in the same way as JEM. The whole partition structure is named multiple-type-tree.

An extended quad tree is now discussed. FIG. 7 is a schematic diagram 700 of example extended quad-tree (EQT) partitioning structures. An EQT partitioning structure corresponding to a block partitioning process includes an extended quad tree partitioning process for the block of video data. The extended quad partitioning structure represents partitioning the block of video data into final sub-blocks. When the extended quad tree partitioning process decides to apply an extended quad tree partition to a block, the block is always split into four sub-blocks. Decoding of the final sub-blocks is based on the video bitstream. Decoding of the block of video data is based on the final sub-blocks decoded according to the EQT structure derived.

The EQT partitioning process can be applied to a block recursively to generate EQT leaf nodes. Alternatively, when EQT is applied to a certain block, for each of the sub-blocks resulting from the EQT split, may further be split into BT and/or QT and/or TT and/or EQT and/or other kinds of partition trees. In one example, EQT and QT may share the same depth increment process and the same restrictions of leaf node sizes. In this case, the partitioning of one node can be implicitly terminated when the size of the node reaches a minimum allowed quad tree leaf node size or EQT depth when the node reaches a maximum allowed quad tree depth. Alternatively, EQT and QT may share different depth increment processes and/or restrictions of leaf node sizes. The partitioning of one node by EQT may be implicitly terminated when the size of the node reaches a minimum allowed EQT leaf node size or the EQT depth associated with the node reaches a maximum allowed EQT depth. In one example, the EQT depth and/or the minimum allowed EQT leaf node sizes may be signaled in a sequences parameter set (SPS), a picture parameter set (PPS), a slice header, a CTU, a region, a tile, and/or a CU.

EQT may not use a quad tree partition applied to a square block, for example where the block has a size of M×N where M and N are equal or unequal non-zero positive integer values. Instead, EQT splits one block equally into four partitions, such as an M/4×N split 701 or an M×N/4 split 703. Split 727 and split 729 show general examples of split 701 and 703, respectively. For example, split 727 is split into M×N1, M×N2, M×N3, and M×N4, where N1+N2+N3+N4=N. Further, split 729 is split into M1×N, M2×N, M3×N and M4×N where M1+M2+M3+M4=M.

In another example, the EQT can split the shape equally into four partitions where the partition size is dependent on the maximum and minimum values of M and N. In one example, one 4×32 block may be split into four 4×8 sub-blocks while a 32×4 block may be split into four 8×4 sub-blocks.

In another example, EQT splits one block equally into four partitions, such as two partitions are with size equal to (M*w0/w)×(N*h0/h) and the other two are with (M*(w−w0)/w)×(N*(h−h0)/h) as shown by split 705, split 707, split 709, and split 711. For example, w0 and w may be equal to 1 and 2, respectively, such that the width is reduced by half while the height can use other ratios instead of 2:1 to get the sub-blocks. In another example, h0 and h may be equal to 1 and 2, respectively, such that the height is reduced by half while the width can use other ratios instead of 2:1. For example, split 705 includes a sub-block width fixed to be M/2 with a height equal to N/4 or 3N/4 with a smaller selection for the top two partitions. For example, split 707 includes a sub-block height fixed to be N/2 with a width equal to M/4 or 3M/4 with a smaller selection for the left two partitions. For example, split 709 includes a sub-block width fixed to be M/2 with a height equal to N/4 or 3N/4 with a smaller selection for the bottom two partitions. For example, split 711 includes a sub-block height fixed to be N/2 with a width equal to M/4 or 3M/4 with a smaller selection for the right two partitions.

Split 713, split 715, split 717, split 719, split 721, and split 723 show other examples of quad tree partitioning. For example, split 713, split 715, and split 717 show options where the shape is split by M×N/4 and M/2×N/2. For example, split 719, split 721, and split 723 show options where the shape is split by N×M/4 and N/2×M/2.

Split 725 shows a more general case of quad tree partitioning with different shapes of partitions. In this case, split 725 is split such that M1×N1, (M−M1)×N1, M1×(N−N1) and (M−M1)×(N−N1).

FIG. 8 is a schematic diagram 800 of example flexible tree (FT) partitioning structures. A FT partitioning structure corresponds to a block partitioning process including an FT partitioning process for the block of video data. The FT partitioning structure represents a partitioning for a block of video data into final sub-blocks. When the FT partitioning process decides to apply a FT partition to a block, the block is split into K sub-blocks wherein K could be larger than 4. The final sub-blocks can be coded based on the video bitstream. Further, the block of video data can be decoded based on the final sub-blocks decoded according to the FT structure derived. The FT partitioning process can be applied to a given block recursively to generate FT tree leaf nodes. The partitioning of one node is implicitly terminated when the node reaches a minimum allowed FT leaf node size or FT depth associated when the node reaches a maximum allowed FT depth. Further, when FT is applied to a certain block, multiple sub-blocks can be created. Each of the sub-blocks created by FT may further be split into BT, QT, EQT, TT, and/or other kinds of partition trees. In an example, the FT depth or the minimum allowed FT leaf node sizes or the minimum allowed partition size for FT may be signaled in a SPS, a PPS, a slice header, a CTU, a region, a tile, and/or a CU. Similar to EQT, all of the sub-blocks created by FT partitions may be the same or different sizes.

Schematic diagram 800 includes example FT partitioning structures where the number of sub-blocks, denoted as K, is set equal to six or eight. Split 801 is a partitioning structure with K=8, M/4*N/2. Split 803 is a partitioning structure with K=8, M/2*N/4. Split 805 is a partitioning structure with K=6, M/2*N/2 and M/4*N/2. Split 807 is a partitioning structure with K=6, M/2*N/2 and M/2*N/4.

FIG. 9 is a schematic diagram 900 of example generalized TT (GTT) partitioning structures. For the TT partitioning structure, the restriction of splitting along either horizontal or vertical may be removed. The GTT partition pattern may be defined as splitting for both horizontal and vertical. Split 901 employs a left split from a vertical TT split and a horizontal BT split of the remaining area. Split 903 employs a bottom split from a horizontal TT split and a vertical BT split of the remaining area. In some examples, the partitioning EQT, FT, and/or GTT partitioning methods may be applied under certain conditions. In other words, when the condition(s) are not satisfied, there is no need to signal the partition types. In another example, the EQT, FT, and/or GTT partitioning methods may be used to replace other partition tree types. In another example, the EQT, FT, and/or GTT partitioning methods may be only used as a replacement for other partition tree types under certain conditions. In one example, the condition may be based on the picture, slice types, block sizes, the coded modes; and/or whether a block is located at a picture, slice, and/or tile boundary. In one example, EQT may be treated in the same way as QT. In this case, when the QT partition tree type is selected, more flags/indications of the detailed quad-tree partition patterns may be further signaled. In some examples, EQT may be treated as additional partition patterns. In one example, the signaling of partitioning methods of EQT, FT, and/or GTT may be conditional. For example, one or more EQP, FT, and/or GTT partitioning methods may not be used in some cases, and the bits corresponding to signal these partitioning methods are not signaled.

FIG. 10 is a schematic diagram of example boundary partitioning tree 1000, which is also known as a versatile boundary partition. The boundary partitioning tree 1000 is an example boundary handling method for VVC and/or Audio and Video Coding Standard Workgroup Part three (AVS-3.0). Since the forced quadtree boundary partition solution in VVC is not optimized, the boundary partitioning tree 1000 uses regular block partition syntax to maintain continuity with the CABAC engine as well as to match the picture boundary. The versatile boundary partition obtains the following rules (both encoder and decoder). Since the boundary partitioning tree 1000 uses exactly the same partition syntax of the normal block (non-boundary) for boundaries, the syntax is not changed. If the no split mode is parsed for the boundary CU, the forced boundary partition (FBP) is used to match the picture boundary. After the forced boundary partition is used (non-singling boundary partition), no further partition is performed. The forced boundary partition is described as follows. If the size of block is larger than the maximal allowed BT size, forced QT is used to perform the FBP in the current forced partition level. Otherwise, if the bottom-right sample of current CU is located below the bottom picture boundary and not extended to the right boundary, a forced horizontal BT is used to perform the FBP in the current forced partition level. Otherwise, if the bottom-right sample of current CU is located at the right side of the right picture boundary and not below the bottom boundary, a forced vertical BT is used to perform the FBP in the current forced partition level. Otherwise, if the bottom-right sample of current CU is located at the right side of the right picture boundary and below the bottom boundary, a forced QT is used to perform the FBP in the current forced partition level.

FIG. 11 is a schematic diagram 1100 of example partitioning structures used in Audio and Video Coding Standard (AVS) part three (AVS-3.0). Partitioning in AVS-3.0 is now discussed. The Audio and Video Coding Standard (AVS) Workgroup of China was authorized to be established by the Science and Technology Department under the former Ministry of Industry and Information Technology of People's Republic of China. With the mandate of satisfying the demands from the rapidly growing information industry, AVS is committed to producing technical standards of high quality for compression, decompression, processing, and representation of digital audio and video, and thus providing digital audio-video equipment and systems with high-efficient and economical coding/decoding technologies. AVS can be applied in wide variety of significant information sectors including high-resolution digital broadcast, high-density laser-digital storage media, wireless broad-band multimedia communication and internet broad-band stream media. AVS is one of the second generation of source coding/decoding standards and owns independent Chinese intellectual property rights. Source coding technology primarily addresses the problem of coding and compressing audio and video mass data from initial data and original sources. Hence AVS is known as digital video and audio coding technology, and is the premise of the subsequent digital transmission, storage, and broadcast. Further, AVS serves as a common standard for the digital video and audio industry.

AVS-3.0 employs a QT partitioning 1101, a vertical BT partitioning 1105, a horizontal BT partitioning 1103, a horizontal extended quad-tree (EQT) partitioning 1107, and a vertical EQT partitioning 1109 to split a largest coding unit (LCU) into multiple CUs. QT partitioning, BT partitioning, and EQT partitioning can all be used for the root, internal nodes, or leaf nodes of the partitioning tree. However, QT partitioning is forbidden after any BT and/or EQT partitioning.

FIG. 12 is a schematic diagram 1200 of example Unsymmetrical Quad-Tree (UQT) partitioning structures. UQT partitioning employs a block with dimensions W×H, which is split into four partitions with dimensions W1×H1, W2×H2, W3×H3 and W4×H4, where W1, W2, W3, W4, H1, H2, H3, H4 are all integers. In one example, and at least one of the partitions has different block size compared to others. In one example, only two of the four partitions may have equal size, and the other two are different with each other and different from the two partitions with equal size. In one example, all the parameters are in the form of power of 2. For example, W1=2N1, W2=2N2, W3=2N3, W4=2N4, H1=2M1, H2=2M2, H3=2M3, H4=2M4. In one example, UQT only splits one partition in vertical direction, for example, H1=H2=H3=H4=H. In one example, in split 1201 W1=W/8, W2=W/2, W3=W/8, W4=W/4, H1=H2=H3=H4=H. This kind of UQT is vertical split and named as UQT1-V. In one example, in split 1203 W1=W/8, W2=W/2, W3=W/4, W4=W/8, H1=H2=H3=H4=H. This kind of UQT is vertical split and named as UQT2-V. In one example in split 1205 W1=W/4, W2=W/8, W3=W/2, W4=W/8, H1=H2=H3=H4=H. This kind of UQT is vertical split and named as UQT3-V. In one example, in split 1207 W1=W/8, W2=W/4, W3=W/2, W4=W/8, H1=H2=H3=H4=H. This kind of UQT is vertical split and named as UQT4-V.

In one example, UQT only splits one partition in horizontal direction, for example, W1=W2=W3=W4=W. In one example, in split 1209 H1=H/8, H2=H/2, H3=H/8, H4=H/4, W1=W2=W3=W4=W. This kind of UQT is horizontal split and named as UQT1-H. In one example, in split 1211 H1=H/8, H2=H/2, H3=H/4, H4=H/8, W1=W2=W3=W4=W. This kind of UQT is horizontal split and named as UQT2-H. In one example, in split 1213 H1=H/4, H2=H/8, H3=H/2, H4=H/8, W1=W2=W3=W4=W. This kind of UQT is horizontal split and named as UQT3-H. In one example, in split 1215 H1=/8, H2=1/4, H3=H/2, H4=H/8, W1=W2=W3=W4=W. This kind of UQT is horizontal split and named as UQT4-H.

FIG. 13 is a schematic diagram 1300 of example ETT partitioning structures, including an ETT-V split 1301 and an ETT-H split 1303. When employing ETT, a block with dimensions width times height (W×H) is split into three partitions with dimensions W1×H1, W2×H2, and W3×H3. W1, W2, W3, H1, H2, H3 are all integers. In an example, and at least one of the parameters is not in the form of power of 2. W1, W2, and W3 are widths of resulting sub-blocks. H1, H2, and H3 are heights of resulting sub-blocks. In one example, W2 cannot be in a form of W2=2N2 with any positive integer N2. In another example, H2 cannot be in a form of H2=2N2 with any positive integer N2. In one example, at least one of the parameters is in the form of power of 2. In one example, W1 is in a form of W1=_(2N1) with a positive integer N1. In another example, H1 is in a form of H1=2N1 with a positive integer N1.

In one example, ETT only splits one partition in a vertical direction, for example where W1=a1*W, W2=a2*W, and W3=a3*W, where a1+a2+a3=1, and where H1=H2=H3=H. This kind of ETT is vertical split and may be referred to as ETT-V. In one example, ETT-V split 1301 can be used where W1=W/8, W2=3*W/4, W3=W/8, and H1=H2=H3=H. In one example, ETT only splits one partition in horizontal direction, for example where H1=a1*H, H2=a2*H, and H3=a3*H, where a1+a2+a3=1, and where W1=W2=W3=W. This kind of ETT is a horizontal split and may be referred to as ETT-H. In one example, ETT-H split 1303 can be used where H1=H/8, H2=3*H/4, H3=H/8, and W1=W2=W3=W.

FIG. 14 is a schematic diagram 1400 of example ¼ UBT partitioning structures, which includes vertical UBT (UBT-V) partitions and horizontal UBT (UBT-H) partitions. A block of dimensions W×H can be split into two sub-blocks dimensions W1×H1 and W2×H2, where one of the sub-blocks is a dyadic block and the other is a non-dyadic block. Such a split is named as Unsymmetric Binary Tree (UBT) split. In one example, W1=a×W, W2=(1−a)×W, and H1=H2=H. In such as case, the partition may be called a vertical UBT (UBT-V). In one example, a may be smaller than ½, such as ¼, ⅛, 1/16, 1/32, 1/64, etc. In such a case, the partition may be called a Type 0 UBT-V, an example of which is shown as split 1401. In one example, a may be larger than ½, such as ¾, ⅞, 15/16, 31/32, 63/64, etc. In such a case, the partition is called a Type 1 UBT-V, an example of which is shown as split 1403. In one example, H1=a×H, H2=(1−a)×H, W1=W2=W. In such a case, the partition may be called a horizontal UBT (UBT-H). In one example, a may be smaller than ½, such as ¼, ⅛, 1/16, 1/32, 1/64, etc. In such a case, the partition is called a Type 0 UBT-H, an example of which is shown as split 1405. In one example, a may be larger than ½, such as ¾, ⅞, 15/16, 31/32, 63/64, etc. In such a case, the partition may be called a Type 1 UBT-H, an example of which is shown as split 1407.

Therefore, there are multiple different possible partitioning schemes (e.g., QT, BT, TT, UQT, EQT, UBT, and/or ETT) by which to partition a current block. An encoder may determine one or more partitioning schemes from the multitude of different possible partitioning schemes by which to partition a current block. Therefore, there may be too many combinations of different partitioning schemes by which to test the partitioning of the current block, before determining an optimal partitioning scheme by which to partition the current block. The testing of different partitioning schemes for a current block may require a large amount of computing resources, and the encoding of all the possible partitioning schemes into a bitstream may also require a large amount of computing and networking resources.

Disclosed herein are embodiments directed to a technical solution to the foregoing technical problem. In an embodiment, an encoder may use information regarding neighboring blocks to determine whether a specific partition scheme is enabled, or allowed, for coding of a current block. The determination may be based on a rule associated with one or more neighboring blocks of the current block. For example, the rule may indicate that a partitioning scheme is allowed or disallowed (i.e., enabled or disabled) for coding of the current block based on various factors, as further described below. In an embodiment, the encoder may perform a conversion between a visual media data and a bitstream based on whether the partitioning scheme is enabled for coding of the current block.

As used herein, the term “current block” may be CU, PU, TU, coding block (CB), prediction block (PB), transform block (TB), or a region containing multiple samples/pixels. The term “partitioning scheme” may also refer to a “partitioning type,” “split type,” or “split method” of the current block, and different examples of various partitioning schemes are described herein with reference to FIGS. 2-14 . The detailed embodiments below should be considered as examples to explain general concepts. These embodiments should not be interpreted in a narrow way. Furthermore, these embodiments can be combined in any manner. The partitioning schemes QT, BT, TT, UQT, EQT, UBT, and ETT may also be referred to herein as “QT split”, “BT split”, “TT split”, “UQT split”, “EQT split” “UBT split” and “ETT split”, respectively. One split or partition could be used to indicate the splitting pattern, like QT/BT/TT/EQT/UQT/UBT/ETT, or one split or partition may be used to indicate a specific splitting method of a splitting pattern, e.g., horizontal UQT or ¼ UBT. As used herein, a block is a “dyadic block” if both a width and a height of the block is a dyadic number, which is in a form of a 2^(N) with N being a positive integer. In contrast, a block is a “non-dyadic block” if at least one of the width and the height is a non-dyadic number, which cannot be represented in a form of a 2^(N), with N being a positive integer. In the following discussion, “split” and “partitioning” have the same meaning. The term “neighboring block” may also be referred to herein as a “neighboring sample” or a “neighboring coding unit.” A neighboring block may refer to adjacent or non-adjacent neighboring samples or neighboring blocks of a current block in current picture/slice/tile/brick containing the current block or in a different picture/slice/tile/brick. A neighboring block is adjacent to the current block when the current block includes boundary coordinates that are consecutive with and not overlapping with the boundary coordinates of the neighboring blocks, or when the current block abuts the neighboring block. A neighboring block is non-adjacent to the current block when the current block includes boundary coordinates that are not consecutive with and not overlapping with the boundary coordinates of the neighboring blocks.

FIG. 15 is a schematic diagram of a current block 1503, surrounding by multiple neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, 1521, and 1524. In FIG. 15 , blocks 1509 and 1512 may be included in a first CU 1560, while blocks 1518 and 1521 may be included in a second CU 1565. While FIG. 15 only shows seven neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, 1521, and 1524 and two CUs 1560 and 1565, it should be appreciated that the current block 1503 may be surrounded by any number of neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, 1521, and 1524, and the blocks 1506, 1509, 1512, 1515, 1518, 1521, 1521, and 1524 may be included in any number of CUs 1560 and 1565. In addition, while FIG. 15 shows neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, 1521, and 1524 as being adjacent to the current block 1503, it should be appreciated that the neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524 may also be non-adjacent to the current block 1503.

As shown in FIG. 15 , the current block 1503 has a width (W) and a height (H). The current block 1503 includes a top left coordinate position 1530. The top left coordinate position 1530 may refer to the point at the top left corner of the current block 1503. For example, the top left coordinate position 1530 may have a coordinate position of (0,0) or (xCurr, yCurr). From the top left coordinate position 1530, the coordinate positions within the current block 1503 may increase, or decrease, along the X axis in the horizontal direction, and increase, or decrease, along the Y axis in the vertical direction. For example, the coordinate positions within the current block 1503 may increase along the X axis, from the top left coordinate position 1530, to the top right coordinate position 1533 at the top right corner of the current block 1503. Similarly, the coordinate positions within the current block 1503 may increase along the Y axis, from the top left coordinate position 1530, to the bottom left coordinate position 1536 at the bottom left corner of the current block 1503.

As mentioned above, the current block 1503 may be adjacent to, or non-adjacent to, neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524. Neighboring block 1506 may be a top left corner neighboring block 1506, adjacent to, non-adjacent to, or abutting the top left coordinate position 1530. Neighboring block 1509 may be a top left upper neighboring block 1509, which may be adjacent to, non-adjacent to, or abutting a top left inside neighboring sample of the current block 1503. The top left upper neighboring block 1509 may be positioned along or proximate to a top side 1539 of the current block 1503. Neighboring block 1512 may be a top right upper neighboring block 1512, which may be adjacent to, non-adjacent to, or abutting a top right inside neighboring sample of the current block 1503. The top right neighboring block 1512 may also be positioned along or proximate to a top side 1539 of the current block 1503. Neighboring block 1515 may be a top right corner neighboring block 1515, adjacent to, non-adjacent to, or abutting the top right coordinate position 1533. Neighboring block 1518 may be a top left lower neighboring block 1518, which may be adjacent to, non-adjacent to, or abutting a top left lower neighboring sample of the current block 1503. The top left lower neighboring block 1518 may be positioned along or proximate to a left side 1542 of the current block 1503. Neighboring block 1521 may be a bottom left upper neighboring block 1521, which may be adjacent to, non-adjacent to, or abutting a bottom left inside neighboring sample of the current block 1503. The bottom left upper neighboring block 1521 may also be positioned along or proximate to a left side 1542 of the current block. Lastly, neighboring block 1524 may be a bottom left corner neighboring block 1524, adjacent to, non-adjacent to, or abutting the bottom right coordinate position 1536.

Example 1

In an embodiment, “neighboring samples” or “neighboring blocks” may refer to adjacent or non-adjacent neighboring samples or neighboring blocks of a current block in a current picture including the current block or a different picture. In an embodiment, the relative positions of seven neighbouring blocks of the current block 1503 (with the current block being a CU as an example) are shown in FIG. 15 . In an embodiment, the neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524 may be set to be unavailable if one or more conditions below are satisfied, such that the information from the neighboring block 1506, 1509, 1512, 1515, 1518, 1521, and 1524 is disallowed to be used to determine whether a specific partitioning scheme/a specific split (e.g., horizontal/vertical UBT/UQT/ETT) is allowed or disallowed (e.g., enabled for coding of a current block). For example, the conditions may relate to whether the neighboring block is not encoded/decoded/reconstructed yet, whether the neighboring block is in a different CTU row, whether the neighboring block is in a different virtual pipeline data unit (VPDU), subpicture, slice, tile, or brick relative to the current block 1503.

Example 2

In an embodiment, whether one kind of split or partitioning scheme is allowed for the current block may depend on information of neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524 of the current block 1503. The information of any neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524, adjacent or non-adjacent to the current block 1503, may be used to determine whether one kind of split or partitioning scheme is allowed or disallowed (e.g., enabled for coding of a current block). In the embodiment shown in FIG. 15 , the top left upper neighboring block 1509, and/or the top right upper neighboring block 1512, and/or the top left lower neighboring block 1518, and/or the bottom left upper neighboring block 1521 may be used to determine whether one kind of split or partitioning scheme is allowed or disallowed. For example, the coded information (or the information associated with the neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524) may refer to coding block locations (e.g., whether it locates at the picture boundary), coding block dimensions, prediction mode, partition information, split information, number of non-zero transform coefficient levels, and etc.

Example 3

A first rule (also referred to herein as a “constraint”) indicates that the partitioning scheme is enabled or disabled (i.e., not enabled), or allowed or disallowed, for the coding of the current block 1503 if the relationship between at least two neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524, and/or the current block 1503, satisfies at least one condition. The partitioning schemes may be BT, TT, UBT, UQT, ETT, vertical/horizontal BT, vertical/horizontal TT, vertical/horizontal UBT, vertical/horizontal ETT, etc.

In an embodiment, whether the rule or constraint is applied may depend on sequence/picture/slice/CTU-level information and/or information of neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524. For example, whether the constraint is held may depend on the slice/picture type.

In an embodiment, whether the rule or constraint is applied may depend on dimensions (W and H) of the current block 1503 and/or the top left coordinate position (xCur, yCur) 1530 of the current block 1503. In one embodiment, thresholds may be defined to determine whether a partitioning scheme is allowed. For example, thresholds T1=t1>>S1 and T2=t2>>S2, may be used to determine whether a partitioning scheme is allowed. T1 and T2 may refer to thresholds, S1 and S2 may refer to a height or width of the blocks output from a partitioning scheme being applied to the current block 1503 or a neighboring block 1506, 1509, 1512, 1515, 1518, 1521, and 1524, and >> may refer to bit shifts that are used to generate the thresholds T1 and T2. For example, the relationship of W and T1, and/or the relationship of H and T2 may be used to determine whether a partitioning scheme is allowed. In an embodiment, the conditions may depend on color components and/or color format. S1 and/or S2 may also depend on color component and/or color format. For example, S1=S2=1 for the luma component. For example, S1=S2=2 for the chroma component with color format 4:2:0. For example, S1=2 for the chroma component with color format 4:2:2. For example, S2=1 for the chroma component with color format 4:2:2. For example, S1=S2=1 for the chroma component with color format 4:4:4. In an embodiment, whether the rule or constraint is held or disabled may further depend on dimensions WL×HL and/or the top left coordinate position (xL, yL) of a CU covering (containing) the top left lower neighboring block 1518 and/or dimensions WT×HT and/or the top left coordinate position (xT, yT) of a CU covering the top left upper neighboring block 1509. In one example, the constraint is held if (xT+WT)>(xCurr+W×n) and (yL+HL)>(yCurr+H×m), wherein n and m are factors such as m=n=1. For example, the partitioning schemes may be UBT, TT, ETT, UQT, BT, QT, vertical/horizontal BT, vertical/horizontal TT, vertical/horizontal UBT, or vertical/horizontal ETT.

In an embodiment, the first rule or constraint may depend on whether the top left upper neighboring block 1509 and the top right upper neighboring block 1512 (NeiT0 and NeiT1) are in the same CU 1560. This rule may only be held if the CU 1560 covering the top left upper neighboring block 1509 and/or the top right upper neighboring block 1512 (NeiT0 and/or NeiT1) is available, as described above in Example 1. In one embodiment, this rule indicates that a partitioning scheme is disallowed if the top left upper neighboring block 1509 and the top right upper neighboring block 1512 (NeiT0 and NeiT1) are in the same CU 1560, hereinafter also referred to as a “first neighboring CU 1560.” The partitioning schemes may be a vertical BT, vertical TT, vertical UBT, vertical UQT, or vertical ETT. In an embodiment, whether the rule is held may depend on whether there are non-zero residues in the first neighboring CU 1560 (e.g., coded block flag of the current chroma transform block (cbf) is not equal to zero). In an embodiment, the rule may be held only if the slice type is I-slice or there are non-zero residues in the first neighboring CU 1560 (e.g., cbf is not equal to zero), and/or if the slice type is I-slice and there are no non-zero residues in the first neighboring CU (e.g., cbf is equal to zero). A slice is a spatially distinct region of a frame that is encoded separately from any other region in the same frame, and an I-slice is associated with an intra-coded picture, and may be complete by itself. In an embodiment, the rule may be disabled (i.e., not be held) if the first neighboring CU 1560 is coded with a specific mode (e.g., affine mode, sub-block transform (SBT) mode (or vertical SBT), or intra sub-block prediction (ISP) (or vertical ISP)). The video encoder and decoder use SBTs and vertical or horizontal ISPs to efficiently code prediction residuals following block-based motion compensation. In another embodiment, this rule indicates that a partitioning scheme is disallowed if the top left upper neighboring block 1509 and the top right upper neighboring block 1512 (NeiT0 and NeiT1) are not in the same CU 1560. For example, only if W is greater than T1 and H is smaller than or equal to T2, the rule is held. For example, when t1=16, t2=16, the partitioning scheme is horizontal UBT. For example, when t1=32, t2=32, the partitioning scheme is horizontal UBT. For example, when t1=32, t2=64, the partitioning scheme is horizontal UBT. For example, when t1=16, t2=32, the partitioning scheme is horizontal UQT. For example, when t1=16, t2=32, the partitioning scheme is horizontal ETT. For example, when t1=32, t2=64, the partitioning scheme is horizontal UQT. For example, when t1=32, t2=64, the partitioning scheme is horizontal ETT. For example, when t1=16, t2=16, the partitioning scheme is horizontal TT.

In an embodiment, the rule or constraint may be held depending on whether the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and NeiL0) are in the same CU 1565. The rule may only be held if the CU covering the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and/or NeiL0) is available. In one embodiment, this rule indicates that a partitioning scheme is disallowed if the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and NeiL0) are in the same CU 1565, denoted as a “second neighboring CU 1565.” The partitioning schemes may be horizontal BT, horizontal TT, horizontal UBT, horizontal UQT, or horizontal ETT. In an embodiment, whether the rule is held may depend on whether there are non-zero residues in the second neighboring CU (e.g., cbf is not equal to zero). In an embodiment, the rule may be held only if the slice type is I-slice or there are non-zero residues in the second neighboring CU (e.g., cbf is not equal to zero), and/or if the slice type is I-slice and there are no non-zero residues in the second neighboring CU (e.g., cbf is equal to zero). In an embodiment, the rule may be disabled (e.g., not be held) if the second neighboring CU 1565 is coded with a specific mode (e.g., affine mode, sub-block transform (SBT) mode (or horizontal SBT), or intra sub-block prediction (ISP) (or horizontal ISP). In another embodiment, this rule indicates that a partitioning scheme is disallowed if the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and NeiL0) are not in the same CU 1565. For example, only if H is greater than T2 and W is smaller than or equal to T1, the rule is held. For example, when t1=16, t2=16, the partitioning scheme is vertical UBT. For example, when t1=32, t2=32, the partitioning scheme is vertical UBT. For example, when t1=64, t2=32, the partitioning scheme is vertical UBT. For example, when t1=32, t2=16, the partitioning scheme is vertical UQT. For example, when t1=32, t2=16, the partitioning scheme is vertical ETT. For example, when t1=64, t2=32, the partitioning scheme is vertical UQT. For example, when t1=64, t2=32, the partitioning scheme is vertical ETT. For example, when t1=16, t2=16, the partitioning scheme is vertical TT.

In an embodiment, the rule or constraint may depend on whether the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and NeiL0) are in the same CU 1565 and whether the top left upper neighboring block 1509 and the top right upper neighboring block 1512 (NeiT0 and NeiT1) are in the same CU 1560. In an embodiment, the rule indicates that a partitioning scheme is disallowed if the top left upper neighboring block 1509 and the top right upper neighboring block 1512 (NeiT0 and NeiT1) are in the same CU 1560, denoted as a first neighboring CU 1560, and the top left lower neighboring block 1518 and the bottom left upper neighboring block 1521 (NeiL0 and NeiL0) are in the same CU 1565, denoted as a second neighboring CU 1565. In an embodiment, the partitioning scheme is QT. In an embodiment, whether the rule is held may depend on whether there are non-zero residues in the first and/or second neighboring CU (e.g., cbf is not equal to zero). In an embodiment, the rule may be held only if the slice type is I-slice or there are non-zero residues in the first and/or second neighboring CU (e.g., cbf is not equal to zero), and/or only if the slice type is I-slice and there are no non-zero residues in the first and/or second neighboring CU (e.g., cbf is equal to zero). In an embodiment, the rule may not be held if the first neighboring CU 1560, and/or the second neighboring CU 1565 is coded with a specific mode (e.g., affine mode, SBT mode (for example, vertical SBT for the first neighboring CU 1560 and horizontal SBT for the second neighboring CU 1565), or ISP (for example, vertical ISP for the first neighboring CU 1560 and horizontal ISP for the second neighboring CU 1565).

In an embodiment, the rule or constraint may depend on the number of CUs (denoted as N) covering a range of neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524. For example, suppose the top left coordinate position 1530 of the current block 1503 is (xCurr, yCurr). A partitioning scheme may be disallowed if N>=T (or >T), wherein T is a threshold, or may be disallowed if N<=T (or <T). For example, T may depend on W and/or H of the current block 1503. In an embodiment, the rule may indicate that the partitioning scheme is allowed or disallowed for the coding of the current block 1503 based on a comparison between a number of coding units covering a range of the one or more neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524 with a threshold. The threshold may be based on at least one of a width of the current block 1503, a height of the current block 1503, split information of the current block 1503 when the portioning scheme is applied to one or more of the neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524, a color component of the current block 1503, or a maximum coding unit size.

In a first method, T=T_(k) if S_(k)<W<=S_(k+1). For example, suppose BB=a×H/BU, in which BU is a number such as 4, and a is a factor such as ¾. BU may depend on the color component. For example, T₀=2, S₀=0 and S₁=BU. For example, T₁=min(BB, max(3, BB/2), S₁=BU and S₂=2×BU. For example, T₂=min(BB, max(4, 3×BB/4), S₂=2×BU and S₃=4×BU. For example, T₂=BB, S3=4×BU and S₄=maximum CU size.

In a second method, T=T_(k) if S_(k)<H<=S_(k)+1. Suppose BB=a×W/BU, wherein BU is a number such as 4, and a is a factor such as ¾. BU may depend on the color component. For example, T₀=2, S₀=0 and S₁=BU. For example, T₁=min(BB, max(3, BB/2), S₁=BU and S₂=2×BU. For example, T₂=min(BB, max(4, 3×BB/4), S₂=2×BU and S₃=4×BU. For example, T₂=BB, S₃=4×BU and S₄=maximum CU size.

In an embodiment, N is the number of CUs covering a row of samples, from (xCurr+offsetStart, yCurr−1) to (xCurr+offsetEnd, yCurr−1), in which offsetStart and/or offsetStart may depend on W. For example, offsetStart=W/4, and offsetEnd=W−1. As another example, offsetStart=0, and offsetEnd=3×W/4−1. In one example, the partitioning scheme is vertical UBT such as split 1401 or split 1403 shown in FIG. 14 ; in one example, T is derived based on the first method or the second method. In either example, the partitioning scheme may be vertical UBT, and T may be derived based on the foregoing first method or second method.

In an embodiment, N is the number of CUs covering a column of samples, from (xCurr−1, yCurr+offsetStart) to (xCurr−1, yCurr+offsetEnd), in which offsetStart and/or offsetStart may depend on H. For example, offsetStart=H/4, and offsetEnd=H−1. As another example, offsetStart=0, and offsetEnd=3×H/4−1. In one example, the partitioning scheme is horizontal UBT such as split 1405 or split 1407 shown in FIG. 14 ; in one example, T is derived based on the first method or the second method. In either example, the partitioning scheme may be horizontal UBT, and T may be derived based on the foregoing first method or second method.

Example 4

In an embodiment, signaling of indications of whether and/or how to split or partitioning a block (e.g., horizontal or vertical; UBT/UQT/ETT/BT/TT) may depend on the proposed constraints or rules regarding partitioning schemes based on neighboring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524. For example, if one partition scheme, or split method, is disallowed (e.g., enabled for coding of the current block 1503), the indication of the partition scheme or split is excluded in the bitstream. Alternatively, furthermore, the enabling of the split is set to be false. For example, a type of partitioning scheme or split is excluded from the possible partitioning schemes that can be represented by a codeword, if the partitioning scheme is disallowed. For example, the indication of a partitioning scheme, or a split method, may be conditionally signalled. The conditions may include the depth information of neighbouring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524/current block 1503, the block dimension of neighbouring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524/current block 1503, prediction mode of the neighbouring blocks 1506, 1509, 1512, 1515, 1518, 1521, and 1524/current block 1503, and/or splitting direction information of the neighbouring blocks/slice or picture types. The depth information may refer to a bit depth, which may indicate a quantity of unique values a pixel may have.

Example 5

The methods in the disclosure may depend on color components. For example, all color components may share the same rules on partitioning. For example, different color components may have a different rule on partitioning.

Example 6

In an embodiment, whether the rules and/or constraints are held or not may depend on sequence/picture/slice/CTU-level information and/or information of neighboring samples/blocks. For example, whether a constraint is held may depend on the slice/picture type.

Example 7

In an embodiment, signaling of whether and/or how to split a block may depend on the rules and/or constraints described herein. For example, a kind of split or partitioning scheme is excluded from the possible partitioning schemes that can be represented by a codeword, if the split is disallowed.

FIG. 16 is a block diagram showing an example video processing system 1600 in which various techniques disclosed herein may be implemented. Various implementations may include some or all of the components of the system 1600. The system 1600 may include input 1602 for receiving video content. The video content may be received in a raw or uncompressed format, e.g., 8- or 10-bit multi-component pixel values, or may be in a compressed or encoded format. The input 1602 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as Wi-Fi or cellular interfaces.

The system 1600 may include a coding component 1604 that may implement the various coding or encoding methods described in the present disclosure. The coding component 1604 may reduce the average bitrate of video from the input 1602 to the output of the coding component 1604 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 1604 may be either stored, or transmitted via a communication connected, as represented by the component 1606. The stored or communicated bitstream (or coded) representation of the video received at the input 1602 may be used by a component 1608 for generating pixel values or displayable video that is sent to a display interface 1610. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or DisplayPort, and so on. Examples of storage interfaces include serial advanced technology attachment (SATA), peripheral component interface (PCI), integrated drive electronics (IDE) interface, and the like. The techniques described in the present disclosure may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.

FIG. 17 is a block diagram of an example video processing apparatus 1700. The apparatus 1700 may be used to implement one or more of the methods described herein. The apparatus 1700 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 1700 may include one or more processors 1702, one or more memories 1704 and video processing circuitry 1706. The processor(s) 1702 may be configured to implement one or more methods described in the present disclosure. The memory (memories) 1704 may be used for storing data and code used for implementing the methods and techniques described herein. The video processing circuitry 1706 may be used to implement, in hardware circuitry, some techniques described in the present disclosure. In some embodiments, the video processing circuitry 1706 may be at least partly included in the processor 1702, e.g., a graphics co-processor.

FIG. 18 is a flowchart for an example method 1800 of video processing. The method 1800 includes whether a partitioning scheme is enabled for coding of a current block based on a rule associated with one or more neighboring blocks of the current block at step 1802. At step 1804, a conversion is performed between a visual media data and a bitstream based on whether the partitioning scheme is enabled for coding of the current block. For example, step 1802 may include applying the rules or constraints described herein to determine whether a partitioning scheme is allowed for a current block. Step 1804 can then include performing video encoding at an encoder or video decoding at decoder, for example by employing the results determined by the equations and/or algorithms.

In an embodiment, the method further comprises disallowing use of a neighboring block for determining whether a partitioning scheme is enabled for the current block when the current block is coded before the neighboring block, the current block is in a different coding tree unit (CTU) row than the neighboring block, the current block is in a different virtual pipeline data unit (VPDU) than the neighboring block, the current block is in a different subpicture than the neighboring block, the current block is in a different slice than the neighboring block, the current block is in a different tile than the neighboring block, or combinations thereof. In an embodiment, the one or more neighboring blocks of the current block comprise at least one of a top left upper neighboring block, a top right upper neighboring block, a top left lower neighboring block, or a bottom left upper neighboring block. In an embodiment, one or more neighboring blocks are adjacent to the current block. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on at least one of a width of the current block, a height of the current block, or a top left coordinate position of the current block. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on a comparison between at least one of a width or a height of the current block with a threshold, wherein the threshold is determined based on a candidate split position related to the one or more neighboring blocks. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on dimensions of a neighboring block or a top left coordinate position of a coding unit containing the neighboring block. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on whether at least two of the one or more neighboring blocks are in a same coding unit. In an embodiment, the rule is further based on at least one of whether there are non-zero residues in the coding unit, whether a slice type of the coding unit is intra-prediction slice (I-slice), or whether the coding unit is coded according to a specific mode. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on whether a first two of the one or more neighboring blocks are in a first common coding unit, and whether a second two of the one or more neighboring blocks are in a second common coding unit, and wherein the first common coding unit and the second common coding unit are different coding units. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on a comparison between a threshold and a number of coding units containing the one or more neighboring blocks. In an embodiment, the threshold is based on at least one of a width of the current block, a height of the current block, a candidate split position in the current block, a color component of the current block, or a maximum coding unit size. In an embodiment, the rule indicates that the partitioning scheme is enabled or disabled for the coding of the current block based on at least one of a prediction mode, an identity of a sequence, a picture, a slice, a coding tree unit (CTU)-level information of the one or more neighboring blocks. In an embodiment, the rule further specifies a constraint on including an indication of the partitioning scheme in the bitstream. In an embodiment, the constraint specifies that the bitstream omits an indication of the partitioning scheme when a single partitioning scheme is enabled for coding of the current block. In an embodiment, the constraint specifies that the partitioning scheme enabled for coding of the current block is included in the bitstream using a codeword, and wherein a partitioning scheme that is disabled for coding of the current block is excluded from the codeword. In an embodiment, the constraint is based on at least one of depth information, block dimension, or a prediction mode, of the one or more of the neighboring blocks.

It should be noted that the method 1800 can be implemented in an apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, such as video encoder 2000, video decoder 2100, and/or encoder 2200. In such a case, the instructions upon execution by the processor, cause the processor to perform the method 1800. Further, the method 1800 can be performed by a non-transitory computer readable medium comprising a computer program product for use by a video coding device. The computer program product comprises computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the video coding device to perform the method 1800.

FIG. 19 is a block diagram that illustrates an example video coding system 1900 that may utilize the techniques of this disclosure. As shown in FIG. 19 , video coding system 1900 may include a source device 1910 and a destination device 1920. Source device 1910 generates encoded video data which may be referred to as a video encoding device. Destination device 1920 may decode the encoded video data generated by source device 1910 which may be referred to as a video decoding device.

Source device 1910 may include a video source 1912, a video encoder 1914, and an input/output (I/O) interface 1916. Video source 1912 may include a source such as a video capture device, an interface to receive video data from a video content provider, and/or a computer graphics system for generating video data, or a combination of such sources. The video data may comprise one or more pictures. Video encoder 1914 encodes the video data from video source 1912 to generate a bitstream. The bitstream may include a sequence of bits that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. I/O interface 1916 may include a modulator/demodulator (modem) and/or a transmitter. The encoded video data may be transmitted directly to destination device 1920 via I/O interface 1916 through network 1930. The encoded video data may also be stored onto a storage medium/server 1940 for access by destination device 1920.

Destination device 1920 may include an I/O interface 1926, a video decoder 1924, and a display device 1922. I/O interface 1926 may include a receiver and/or a modem. I/O interface 1926 may acquire encoded video data from the source device 1910 or the storage medium/server 1940. Video decoder 1924 may decode the encoded video data. Display device 1922 may display the decoded video data to a user. Display device 1922 may be integrated with the destination device 1920, or may be external to destination device 1920, which can be configured to interface with an external display device.

Video encoder 1914 and video decoder 1924 may operate according to a video compression standard, such as the HEVC standard, VVC standard and other current and/or further standards.

FIG. 20 is a block diagram illustrating an example of video encoder 2000, which may be video encoder 2014 in the system 2000 illustrated in FIG. 20 . Video encoder 2000 may be configured to perform any or all of the techniques of this disclosure. In the example of FIG. 20 , video encoder 2000 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of video encoder 2000. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

The functional components of video encoder 2000 may include a partition unit 2001; a prediction unit 2002, which may include a mode selection unit 2003, a motion estimation unit 2004, a motion compensation unit 2005, and an intra prediction unit 2006; a residual generation unit 2007; a transform processing unit 2008; a quantization unit 2009; an inverse quantization unit 2010; an inverse transform unit 2011; a reconstruction unit 2012; a buffer 2013; and an entropy encoding unit 2014.

In other examples, video encoder 2000 may include more, fewer, or different functional components. In an example, prediction unit 2002 may include an intra block copy (IBC) unit. The IBC unit may perform prediction in an MC mode in which at least one reference picture is a picture where the current video block is located.

Furthermore, some components, such as motion estimation unit 2004 and motion compensation unit 2005 may be highly integrated, but are represented in the example of FIG. 20 separately for purposes of explanation.

Partition unit 2001 may partition a picture into one or more video blocks. Video encoder 2000 and video decoder 2100 may support various video block sizes.

Mode selection unit 2003 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra or inter coded block to a residual generation unit 2007 to generate residual block data and to a reconstruction unit 2012 to reconstruct the encoded block for use as a reference picture. In some examples, mode selection unit 2003 may select a combination of intra and inter prediction (CIIP) mode in which the prediction is based on an inter prediction signal and an intra prediction signal. Mode selection unit 2003 may also select a resolution for a motion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of inter prediction.

To perform inter prediction on a current video block, motion estimation unit 2004 may generate motion information for the current video block by comparing one or more reference frames from buffer 2013 to the current video block. Motion compensation unit 2005 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from buffer 2013 other than the picture associated with the current video block.

Motion estimation unit 2004 and motion compensation unit 2005 may perform different operations for a current video block, for example, depending on whether the current video block is in an I slice, a P slice, or a B slice.

In some examples, motion estimation unit 2004 may perform uni-directional prediction for the current video block, and motion estimation unit 2004 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. Motion estimation unit 2004 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. Motion estimation unit 2004 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. Motion compensation unit 2005 may generate the predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.

In other examples, motion estimation unit 2004 may perform bi-directional prediction for the current video block, motion estimation unit 2004 may search the reference pictures in list 0 for a reference video block for the current video block and may also search the reference pictures in list 1 for another reference video block for the current video block. Motion estimation unit 2004 may then generate reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. Motion estimation unit 2004 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block. Motion compensation unit 2005 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.

In some examples, motion estimation unit 2004 may output a full set of motion information for decoding processing of a decoder. In some examples, motion estimation unit 2004 may not output a full set of motion information for the current video block. Rather, motion estimation unit 2004 may signal the motion information of the current video block with reference to the motion information of another video block. For example, motion estimation unit 2004 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.

In one example, motion estimation unit 2004 may indicate, in a syntax structure associated with the current video block, a value that indicates to the video decoder 2100 that the current video block has the same motion information as another video block.

In another example, motion estimation unit 2004 may identify, in a syntax structure associated with the current video block, another video block and a motion vector difference (MVD). The motion vector difference indicates a difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 2100 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.

As discussed above, video encoder 2000 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 2000 include advanced motion vector prediction (AMVP) and merge mode signaling.

Intra prediction unit 2006 may perform intra prediction on the current video block. When intra prediction unit 2006 performs intra prediction on the current video block, intra prediction unit 2006 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a predicted video block and various syntax elements.

Residual generation unit 2007 may generate residual data for the current video block by subtracting the predicted video block(s) of the current video block from the current video block. The residual data of the current video block may include residual video blocks that correspond to different sample components of the samples in the current video block.

In other examples, there may be no residual data for the current video block for the current video block, for example in a skip mode, and residual generation unit 2007 may not perform the subtracting operation.

Transform processing unit 2008 may generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to a residual video block associated with the current video block.

After transform processing unit 2008 generates a transform coefficient video block associated with the current video block, quantization unit 2009 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values associated with the current video block.

Inverse quantization unit 2010 and inverse transform unit 2011 may apply inverse quantization and inverse transforms to the transform coefficient video block, respectively, to reconstruct a residual video block from the transform coefficient video block. Reconstruction unit 2012 may add the reconstructed residual video block to corresponding samples from one or more predicted video blocks generated by the prediction unit 2002 to produce a reconstructed video block associated with the current block for storage in the buffer 2013.

After reconstruction unit 2012 reconstructs the video block, the loop filtering operation may be performed to reduce video blocking artifacts in the video block.

Entropy encoding unit 2014 may receive data from other functional components of the video encoder 2000. When entropy encoding unit 2014 receives the data, entropy encoding unit 2014 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.

FIG. 21 is a block diagram illustrating an example of video decoder 2100 which may be video decoder 2024 in the system 2000 illustrated in FIG. 20 .

The video decoder 2100 may be configured to perform any or all of the techniques of this disclosure. In the example of FIG. 21 , the video decoder 2100 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of the video decoder 2100. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

In the example of FIG. 21 , video decoder 2100 includes an entropy decoding unit 2101, a motion compensation unit 2102, an intra prediction unit 2103, an inverse quantization unit 2104, an inverse transformation unit 2105, a reconstruction unit 2106, and a buffer 2107. Video decoder 2100 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 2000 (FIG. 20 ).

Entropy decoding unit 2101 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). Entropy decoding unit 2101 may decode the entropy coded video data, and from the entropy decoded video data, motion compensation unit 2102 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. Motion compensation unit 2102 may, for example, determine such information by performing the AMVP and merge mode.

Motion compensation unit 2102 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used with sub-pixel precision may be included in the syntax elements.

Motion compensation unit 2102 may use interpolation filters as used by video encoder 2000 during encoding of the video block to calculate interpolated values for sub-integer pixels of a reference block. Motion compensation unit 2102 may determine the interpolation filters used by video encoder 2000 according to received syntax information and use the interpolation filters to produce predictive blocks.

Motion compensation unit 2102 may use some of the syntax information to determine sizes of blocks used to encode frame(s) and/or slice(s) of the encoded video sequence, partition information that describes how each macroblock of a picture of the encoded video sequence is partitioned, modes indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter coded block, and other information to decode the encoded video sequence.

Intra prediction unit 2103 may use intra prediction modes for example received in the bitstream to form a prediction block from spatially adjacent blocks. Inverse quantization unit 2104 inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 2101. Inverse transform unit 2105 applies an inverse transform.

Reconstruction unit 2106 may sum the residual blocks with the corresponding prediction blocks generated by motion compensation unit 2102 or intra prediction unit 2103 to form decoded blocks. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in buffer 2107, which provides reference blocks for subsequent motion compensation/intra prediction and also produces decoded video for presentation on a display device.

FIG. 22 is a schematic diagram of an example encoder 2200. The encoder 2200 is suitable for implementing the techniques of VVC. The encoder 2200 includes three in-loop filters, namely a deblocking filter (DF) 2202, a sample adaptive offset (SAO) 2204, and an adaptive loop filter (ALF) 2206. Unlike the DF 2202, which uses predefined filters, the SAO 2204 and the ALF 2206 utilize the original samples of the current picture to reduce the mean square errors between the original samples and the reconstructed samples by adding an offset and by applying a finite impulse response (FIR) filter, respectively, with coded side information signaling the offsets and filter coefficients. The ALF 2206 is located at the last processing stage of each picture and can be regarded as a tool trying to catch and fix artifacts created by the previous stages.

The encoder 2200 further includes an intra prediction component 2208 and a motion estimation/compensation (ME/MC) component 2210 configured to receive input video. The intra prediction component 2208 is configured to perform intra prediction, while the ME/MC component 2210 is configured to utilize reference pictures obtained from a reference picture buffer 2212 to perform inter prediction. Residual blocks from inter prediction or intra prediction are fed into a transform (T) component 2214 and a quantization (Q) component 2216 to generate quantized residual transform coefficients, which are fed into an entropy coding component 2218. The entropy coding component 2218 entropy codes the prediction results and the quantized transform coefficients and transmits the same toward a video decoder (not shown). Quantization components output from the quantization (Q) component 2216 may be fed into an inverse quantization (IQ) components 2220, an inverse transform (TT) component 2222, and a reconstruction (REC) component 2224. The REC component 2224 is able to output images to the DF 2202, the SAO 2204, and the ALF 2206 for filtering prior to those images being stored in the reference picture buffer 2212.

A listing of solutions preferred by some embodiments is provided next.

The following solutions show example embodiments of techniques discussed in the previous section.

1. A video processing method, comprising: determining, for a conversion between a current block of a video and a bitstream of the video, whether or which a partitioning scheme is enabled for coding of the current block according to a rule; and performing the conversion based on the determining, wherein the rule is based on one or more neighboring blocks of the current block.

2. The method of solution 1, wherein the one or more neighboring blocks comprise seven neighboring blocks.

3. The method of any of solutions 1-2, wherein the rule specifies that the one or more neighboring blocks used for determining the partitioning scheme are used responsive to the one or more neighboring blocks meeting a condition.

4. The method of solution 3, wherein the condition relates to a decoding order of the blocks.

5. The method of solution 3, wherein the condition relates to whether the current block is in a same coding tree unit or a virtual pipeline data unit (VPDU), a subpicture, a slice, a tile or a brick as the one or more neighboring blocks.

The following solutions show example embodiments of techniques discussed in the previous section.

6. The method of solution 1, wherein the rule specifies the partitioning scheme based on neighboring samples or a neighboring block.

7. The method of solution 6, wherein the neighboring samples or the neighboring block are non-adjacent to the current block.

8. The method of solution 6, wherein the neighboring samples or the neighboring block are adjacent to the current block.

9. The method of any of solutions 1-8, wherein the one or more neighboring blocks include a block that covers a top-left, or a top or a left or a top right or a bottom left or a bottom right sample of the current block.

The following solutions show example embodiments of techniques discussed in the previous section.

10. A method of video processing, comprising: determining, for a conversion between a current block of a video and a bitstream of the video, whether or which a partitioning scheme is enabled for coding of the current block according to a rule; and performing the conversion based on the determining, wherein the rule is based on a relationship between neighboring samples or neighboring blocks of the current block.

11. The method of solution 10, wherein the relationship relates to a sequence, a picture, a slice, a coding tree unit of the neighboring samples or the neighboring blocks.

12. The method of any of solutions 10-11, wherein the rule is further based on a dimension W×H of the current block or a top-left position (xCur, yCur) of the current block.

13. The method of solution 10, wherein the rule is based on whether NeiT0 and NeiT1 are in a same coding unit, where NeiT0 is a neighboring block that covers a top left inside neighboring sample and NeiT1 is a neighboring block that covers a top right inside neighboring sample.

14. The method of solution 10, wherein the rule is based on whether NeiL0 and NeiL1 are in a same coding unit, where NeiL0 is a neighboring block that covers a bottom left inside neighboring sample and NeiL0 is a neighboring block that covers a bottom right inside neighboring sample.

15. The method of solution 10, wherein the rule is based on a number of coding units that cover a range of the neighboring samples.

16. The method of any of solutions 10-15, wherein the rule further specifies a constraint on including an indication of the partitioning scheme in the bitstream.

17. The method of solution 16, wherein the constraint specifies that in case that a single partitioning scheme is allowed for the current block, the bitstream omits an indication of the partitioning scheme.

18. The method of solution 16, wherein the constraint specifies that the partitioning scheme is indicated using a codeword such that a disallowed partitioning scheme is excluded from the codeword.

19. The method of any of solutions 16-18, wherein the constraint is based on a depth information or a block dimension or a prediction mode of the current block or the neighboring blocks.

20. The method of any of solutions 10-19, wherein the rule is further based on a color component of the current block.

21. The method of solutions 10-20, wherein the rule is based on an identity of a sequence, a picture, a slice, a coding tree unit CTU-level information of the neighboring samples or the neighboring blocks.

22. The method of any of solutions 1-21, wherein the conversion includes generating the bitstream from the video.

23. The method of any of solutions 1-21, wherein the conversion includes generating the video from the bitstream.

24. A method of storing a bitstream on a computer-readable medium, comprising generating a bitstream according to a method recited in any one or more of solutions 1-23 and storing the bitstream on the computer-readable medium.

25. A computer-readable medium having a bitstream of a video stored thereon, the bitstream, when processed by a processor of a video decoder, causing the video decoder to generate the video, wherein the bitstream is generated according to a method recited in one or more of solutions 1-24.

26. A video decoding apparatus comprising a processor configured to implement a method recited in one or more of solutions 1 to 24.

27. A video encoding apparatus comprising a processor configured to implement a method recited in one or more of solutions 1 to 24.

28. A computer program product having computer code stored thereon, the code, when executed by a processor, causes the processor to implement a method recited in any of solutions 1 to 24.

29. A computer readable medium on which a bitstream complying to a bitstream format that is generated according to any of solutions 1 to 24.

30. A method, an apparatus, a bitstream generated according to a disclosed method or a system described in the present disclosure.

In the solutions described herein, an encoder may conform to the format rule by producing a coded representation according to the format rule. In the solutions described herein, a decoder may use the format rule to parse syntax elements in the coded representation with the knowledge of presence and absence of syntax elements according to the format rule to produce decoded video.

In the present disclosure, the term “video processing” may refer to video encoding, video decoding, video compression or video decompression. For example, video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa. The bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax. For example, a macroblock may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream. Furthermore, during conversion, a decoder may parse a bitstream with the knowledge that some fields may be present, or absent, based on the determination, as is described in the above solutions. Similarly, an encoder may determine that certain syntax fields are or are not to be included and generate the coded representation accordingly by including or excluding the syntax fields from the coded representation.

The disclosed and other solutions, examples, embodiments, modules and the functional operations described in this disclosure can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this disclosure and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this disclosure can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random-access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and compact disc read-only memory (CD ROM) and digital versatile disc-read only memory (DVD-ROM) disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While this present disclosure contains many specifics, these should not be construed as limitations on the scope of any subject matter or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular techniques. Certain features that are described in this present disclosure in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this present disclosure should not be understood as requiring such separation in all embodiments.

Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in this present disclosure.

A first component is directly coupled to a second component when there are no intervening components, except for a line, a trace, or another medium between the first component and the second component. The first component is indirectly coupled to the second component when there are intervening components other than a line, a trace, or another medium between the first component and the second component. The term “coupled” and its variants include both directly coupled and indirectly coupled. The use of the term “about” means a range including ±10% of the subsequent number unless otherwise stated.

While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented.

In addition, techniques, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled may be directly connected or may be indirectly coupled or communicating through some interface, device, or intermediate component whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and could be made without departing from the spirit and scope disclosed herein. 

What is claimed is:
 1. A method for processing video data, comprising: determining whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and performing a conversion between a video comprising the current block and a bitstream based on the determining.
 2. The method of claim 1, wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block.
 3. The method of claim 1, wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied, wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block; wherein the rules specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled.
 4. The method of claim 1, wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.
 5. The method of claim 1, wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block; wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block.
 6. The method of claim 1, wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition.
 7. The method of claim 6, wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block.
 8. The method of claim 6, wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit; wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.
 9. The method of claim 6, wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit; wherein the first common coding unit and the second common coding unit are different coding units; and wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.
 10. The method of claim 6, wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer.
 11. The method of claim 6, wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT.
 12. The method of claim 6, wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint.
 13. The method of claim 6, wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block.
 14. The method of claim 1, wherein the rule is based on a color component of the current block.
 15. The method of claim 1, wherein the conversion comprises decoding the video from the bitstream.
 16. The method of claim 1, wherein the conversion comprises encoding the video into the bitstream.
 17. An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and perform a conversion between a video comprising the current block and a bitstream based on the determination.
 18. The apparatus of claim 17, wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block; wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied, wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block; wherein the rules specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled; wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block; wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block; wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition; wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block; wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit, wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit; wherein the first common coding unit and the second common coding unit are different coding units; and wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer; wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT; wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint; wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block; and wherein the rule is based on a color component of the current block.
 19. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: determining whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and generating the bitstream based on the determining.
 20. The non-transitory computer-readable recording medium of claim 19, wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block; wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied, wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block; wherein the rules specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled; wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block; wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block; wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition; wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block; wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit, wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit; wherein the first common coding unit and the second common coding unit are different coding units; and wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block; wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer; wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT; wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint; wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block; and wherein the rule is based on a color component of the current block. 